Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

g(x, a, b) → g(b, b, a)

Q is empty.


QTRS
  ↳ RRRPoloQTRSProof

Q restricted rewrite system:
The TRS R consists of the following rules:

g(x, a, b) → g(b, b, a)

Q is empty.

The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

g(x, a, b) → g(b, b, a)

Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:

g(x, a, b) → g(b, b, a)
Used ordering:
Polynomial interpretation [25]:

POL(a) = 2   
POL(b) = 0   
POL(g(x1, x2, x3)) = x1 + 2·x2 + x3   




↳ QTRS
  ↳ RRRPoloQTRSProof
QTRS
      ↳ RisEmptyProof

Q restricted rewrite system:
R is empty.
Q is empty.

The TRS R is empty. Hence, termination is trivially proven.